Exact enumeration approach to fractal properties of the percolation backbone and 1/σ expansion

نویسنده

  • Eugene Stanley
چکیده

An exact enumeration approach is developed for the backbone fractal of the incipient infinite cluster at the percolation threshold. We use this approach to calculate exactly the first low-density expansion of LBB@) for arbitrary system dimensionality d, where L B B @ ) is the mean number of backbone bonds and p is the bond occupation probability. Standard series extrapolation methods provide estimates of the fractal dimension of the backbone for all d ; these disagree with the Sierpinski gasket model of the backbone. We also calculate the first low-density expansions of Lmin@) and L e d @ ) which are, respectively, the mean number of bonds in the minimum path between i and i and the mean number of singly connected (‘red’) bonds. How can one describe the flow of fluid in random porous media? This important question has long eluded explanation. Recently, considerable attention has been focused on the utility of fractals as models of random media. In particular, the topology of the network that exists just at the onset of fluid flow has been modelled by percolation theory. Bonds are considered intact if fluid can flow through them. When the fraction of bonds is small, the system consists of many small finite clusters. However, as the bond fraction approaches a critical value pc the clusters grow large and ramified until at pc fluid can flow. If we consider the network of intact bonds right at pc, there will be a subset of bonds that carry fluid (‘backbone’ bonds) and a remainder that does not (‘dangling ends’). The structure of the backbone remains an important open question. Two models of the backbone have been discussed in the literature. In one (Gefen et a1 1981), the backbone is replaced by a d-dimensional Sierpinski gasket. In the other (Stanley 1977, Coniglio 1981, 1982, Pike and Stanley 1981, Stanley and Coniglio 1983), the backbone is considered to consist of an alternating sequence of singly connected (‘red’) bonds and multiply connected (‘blue’) bonds; these are shown in colour as figure 5 of Hamann (1983). The advantage of the Sierpinski gasket model of the backbone is that one can calculate exactly its fractal dimension, DB = ln(d + l>/ln 2. Hence it is important to obtain estimates of DB for the actual backbone of percolation clusters. Thus far, the only efforts have been Monte Carlo simulations in d = 2, 3 for the backbone order parameter exponent Pe; however, the order parameter is extremely difficult to calculate by Monte Carlo methods (Kirkpatrick 1978, Li and Streider 1982). Also, a limited attempt has been made to estimate the field-like scaling power yl, by large-cell t Supported in part by grants from NSF, ARO and ONR. @ 1983 The Institute of Physics L475 L476 Letter to the Editor position-space renormalisation group; however, this work was limited to d = 2. The Sierpinski gasket model gives reasonable quantitative values for d = 2, 3 but not for higher d. For this and other reasons, it is highly desirable to have calculations of df for the backbone for general d, in order that one can better assess the relative merits of various models of backbone topology. To this end, here we present an exact enumeration approach for the backbone fractal, and calculate the first ten terms in the low-density expansions for arbitrary d . We shall see that these ten terms behave sufficiently smoothly with increasing order that extrapolations to obtain the asymptotic behaviour can be made (table 1) . Table 1. Critical exponents characterising the backbone of the incipient infinite cluster in percolation. The basic quantities calculated are ls and lmin, since ired = 1 for all d (Coniglio 1982). In order to obtain the exponent for the derived quantities LBB(p) and Lmin@), we need yp, which is also tabulated. Finally, to obtain the backbone fractal dimension, De, we need Y. YP U 5 B 5min P B In(d + 1) D ” = y DB =In2

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Self-avoiding walks on fractal spaces : exact results and Flory approximation

2014 Self-avoiding walks (SAW) explore the backbone of a fractal lattice, while random walks explore the full lattice. We show the existence of an intrinsic exponent for SAW and examine a simple Flory approximation that uses the spectral dimension of the backbone. Exact results for various fractal lattices show that this approximation is not very satisfactory and that properties of SAW depend o...

متن کامل

Critical loop gases and the worm algorithm

The loop gas approach to lattice field theory provides an alternative, geometrical description in terms of fluctuating loops. Statistical ensembles of random loops can be efficiently generated by Monte Carlo simulations using the worm update algorithm. In this paper, concepts from percolation theory and the theory of self-avoiding random walks are used to describe estimators of physical observa...

متن کامل

Fractal Properties of the Distribution of Earthquake Hypocenters

We investigate a recent suggestion that the spatial distribution of earthquake hypocenters makes a fractal set with a structure and fractal dimensionality close to those of the backbone of critical percolation clusters, by analyzing four different sets of data for the hypocenter distributions and calculating the dynamical properties of the geometrical distribution such as the spectral dimension...

متن کامل

A model for modified electrode with carbon nanotube composites using percolation theory in fractal space

We introduce a model for prediction the behavior of electrodes which modified withcarbon nanotubes in a polymer medium. These kinds of polymer composites aredeveloped in recent years, and experimental data for its percolation threshold isavailable. We construct a model based on percolation theory and fractal dimensionsand using experimental percolation threshold for calculating the moments of c...

متن کامل

Field-Theoretic Approach to Biconnectedness in Percolating Systems

A general method is given whereby m-connectedness correlation functions can be studied in the percolation problem. The method for m=1 involves calculating the kth power of the correlation function ⟨σ(x)σ(x′)⟩ for a randomly dilute Ising model at nonzero temperature and subsequently averaging over configurations. The final step is to take the limit k→0. This method is tested by reproducing the s...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1983